A note on bounds for the cop number using tree decompositions

In this short note, we supply a new upper bound on the cop number in terms of tree decompositions. Our results in some cases extend a previously derived bound on the cop number using treewidth

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic cop number. We analyze the cases of graphs with diameter 2 or at least 3, focusing on when the hyperopic cop number is at most one greater than the cop number. We show that for planar graphs, as with the usual cop number, the hyperopic cop number is at most 3. The hyperopic cop number is considered for countable graphs, and it is shown that for connected chains of graphs, the hyperopic cop density can be any real number in $[0,1/2].

The Firefighter Problem: A Structural Analysis

We consider the complexity of the firefighter problem where b>=1 firefighters are available at each time step. This problem is proved NP-complete even on trees of degree at most three and budget one (Finbow et al.,2007) and on trees of bounded degree b+3 for any fixed budget b>=2 (Bazgan et al.,2012). In this paper, we provide further insight into the complexity landscape of the problem by showing that the pathwidth and the maximum degree of the input graph govern its complexity. More precisely, we first prove that the problem is NP-complete even on trees of pathwidth at most three for any fixed budget b>=1. We then show that the problem turns out to be fixed parameter-tractable with respect to the combined parameter "pathwidth" and "maximum degree" of the input graph

NP-Completeness Results for Graph Burning on Geometric Graphs

Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of the graph. The spread of social influence, an alarm, or a social contagion can be modeled using graph burning. The less the burning number, the faster the spread. Optimal burning of general graphs is NP-Hard. There is a 3-approximation algorithm to burn general graphs where as better approximation factors are there for many sub classes. Here we study burning of grids; provide a lower bound for burning arbitrary grids and a 2-approximation algorithm for burning square grids. On the other hand, burning path forests, spider graphs, and trees with maximum degree three is already known to be NP-Complete. In this article we show burning problem to be NP-Complete on connected interval graphs, permutation graphs and several other geometric graph classes as corollaries.Comment: 17 pages, 5 figure

Structure of aluminum atomic chains

First-principles density functional calculations reveal that aluminum can form planar chains in zigzag and ladder structures. The most stable one has equilateral triangular geometry with four nearest neighbors; the other stable zigzag structure has wide bond angle and allows for two nearest neighbors. An intermediary structure has the ladder geometry and is formed by two strands. All these planar geometries are, however, more favored energetically than the linear chain. We found that by going from bulk to a chain the character of bonding changes and acquires directionality. The conductance of zigzag and linear chains is 4e^2/h under ideal ballistic conditions.Comment: modified detailed version, one new structure added, 4 figures, modified figure1, 1 tabl

Recent developments in modeling of the stress derivative of magnetization in ferromagnetic materials

The effect of changing stress on the magnetization of ferromagnetic materials leads to behavior in which the magnetization may increase, or decrease, when exposed to the same stress under the same external conditions. A simple empirical law seems to govern the behavior when the magnetization begins from a major hysteresis loop. The application of the law of approach, in which the derivative of the magnetization with respect to the elastic energy supplied dM/dW is proportional to the magnetization displacement M an−M, is discussed

Structural Transitions and Global Minima of Sodium Chloride Clusters

In recent experiments on sodium chloride clusters structural transitions between nanocrystals with different cuboidal shapes were detected. Here we determine reaction pathways between the low energy isomers of one of these clusters, (NaCl)35Cl-. The key process in these structural transitions is a highly cooperative rearrangement in which two parts of the nanocrystal slip past one another on a {110} plane in a direction. In this way the nanocrystals can plastically deform, in contrast to the brittle behaviour of bulk sodium chloride crystals at the same temperatures; the nanocrystals have mechanical properties which are a unique feature of their finite size. We also report and compare the global potential energy minima for (NaCl)NCl- using two empirical potentials, and comment on the effect of polarization.Comment: extended version, 13 pages, 8 figures, revte

Eternal Domination in Grids

In the eternal domination game played on graphs, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices on their turn. The goal is to determine the eternal domination number $\gamma^{\infty}_{all}$ of a graph which is the minimum number of guards required to defend against an infinite sequence of attacks.This paper continues the study of the eternal domination game on strong grids $P_n\boxtimes P_m$. Cartesian grids $P_n \square P_m$ have been vastly studied with tight bounds existing for small grids such as $k\times n$ grids for $k\in \{2,3,4,5\}$. It was recently proven that $\gamma^{\infty}_{all}(P_n \square P_m)=\gamma(P_n \square P_m)+O(n+m)$ where $\gamma(P_n \square P_m)$ is the domination number of $P_n \square P_m$ which lower bounds the eternal domination number [Lamprou et al., CIAC 2017]. We prove that, for all $n,m\in \mathbb{N^*}$ such that $m\geq n$, $\lfloor \frac{n}{3} \rfloor \lfloor \frac{m}{3} \rfloor+\Omega(n+m)=\gamma_{all}^{\infty} (P_{n}\boxtimes P_{m})=\lceil \frac{n}{3} \rceil \lceil \frac{m}{3} \rceil + O(m\sqrt{n})$ (note that $\lceil \frac{n}{3} \rceil \lceil \frac{m}{3} \rceil$ is the domination number of $P_n\boxtimes P_m$). Our technique may be applied to other ``grid-like" graphs

Neurotrophin-3 Is Involved in the Formation of Apical Dendritic Bundles in Cortical Layer 2 of the Rat

Apical dendritic bundles from pyramidal neurons are a prominent feature of cortical neuropil but with significant area specializations. Here, we investigate mechanisms of bundle formation, focusing on layer (L) 2 bundles in rat granular retrosplenial cortex (GRS), a limbic area implicated in spatial memory. By using microarrays, we first searched for genes highly and specifically expressed in GRS L2 at postnatal day (P) 3 versus GRS L2 at P12 (respectively, before and after bundle formation), versus GRS L5 (at P3), and versus L2 in barrel field cortex (BF) (at P3). Several genes, including neurotrophin-3 (NT-3), were identified as transiently and specifically expressed in GRS L2. Three of these were cloned and confirmed by in situ hybridization. To test that NT-3–mediated events are causally involved in bundle formation, we used in utero electroporation to overexpress NT-3 in other cortical areas. This produced prominent bundles of dendrites originating from L2 neurons in BF, where L2 bundles are normally absent. Intracellular biocytin fills, after physiological recording in vitro, revealed increased dendritic branching in L1 of BF. The controlled ectopic induction of dendritic bundles identifies a new role for NT-3 and a new in vivo model for investigating dendritic bundles and their formation